#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 5e5 + 5;

int n, a, b;
int w[N];
bool check(int t) {
  int pos = upper_bound(w + 1, w + n + 1, a * t) - w;
  int cnt = 0;
  rep(i, pos, n) cnt += (w[i] - a * t + b - 1) / b;
  return cnt <= t;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> a >> b;
  rep(i, 1, n) cin >> w[i];
  sort(w + 1, w + n + 1);
  int l = w[n] / (a + b), r = w[n] / a;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (check(mid))
      r = mid - 1;
    else
      l = mid + 1;
  }
  cout << l;
  return 0;
}